Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional Uni-polar (Optical) Orthogonal Codes

نویسندگان

  • Ram Chandra Singh Chauhan
  • Yatindra Nath Singh
  • Rachna Asthana
چکیده

— This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The cardinality of each set is equal to upper bound. The codes within a set can be searched for general values of code length 'n', code weight 'w', auto-correlation constraint less than or equal to a  , and cross-correlation constraint less than or equal to c  , such that (,) ac nw  . Each set forms a maximal clique of the codes within given range of correlation properties (,) ac . These one-dimensional uni-polar orthogonal codes can find their application as signature sequences for spectral spreading purpose in incoherent optical code division multiple access (CDMA) systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uni-polar Orthogonal Codes : Design, Analysis and Applications

The uni-polar orthogonal codes, with code length 'n' and code weight 'w' having auto-correlation and cross-correlation constraints equal to 1, can be designed with proposed algorithm. This proposed scheme design all the possible groups containing maximum number of orthogonal codes as per Johnson bounds. In this case, each of the designed groups is independent with other groups of uni-polar orth...

متن کامل

Design of Two Dimensional Unipolar (Optical) Orthogonal Codes Through One Dimensional Unipolar (Optical) Orthogonal Codes

— In this paper, an algorithm for construction of multiple sets of two dimensional (2D) or matrix unipolar (optical) orthogonal codes has been proposed. Representations of these 2D codes in difference of positions representation (DoPR) have also been discussed along-with conventional weighted positions representation (WPR) of the code. This paper also proposes less complex methods for calculati...

متن کامل

Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

متن کامل

A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar (Optical) Orthogonal Codes with Same Code-length and Low Weight

— This paper describes a search algorithm to find multiple sets of one dimensional unipolar (optical) orthogonal codes characterized by parameter ac nw. Here binary code sequence of length 'n' ('n' bits) and weight 'w' (number of bit '1's in the sequence) with w << n, as well as a  and c  are auto- from 1 to w-1, multiple sets can be searched out of the codes with auto-correlation constrai...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1309.0193  شماره 

صفحات  -

تاریخ انتشار 2013